Optimization Over Pseudo-Boolean Lattices
نویسندگان
چکیده
In this paper, first we will find the solution of the system A ∗ X ≤ b, where A, b are the known suitable matrices and X is the unknown matrix over a pseudoBoolean lattice. Then its application to find the solution of some fuzzy linear systems as well as finding the solution of the optimization problem Z = max{C∗X|A∗ X ≤ b} is discussed. Key-words: pseudo-Boolean lattice, linear programming, fuzzy linear systems, optimization.
منابع مشابه
Regularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملPseudo-Boolean Optimization: Theory and Applications in Vision
Many problems in computer vision, such as stereo, segmentation and denoising can be formulated as pseudo-boolean optimization problems. Over the last decade, graphs cuts have become a standard tool for solving such problems. The last couple of years have seen a great advancement in the methods used to minimize pseudoboolean functions of higher order than quadratic. In this paper, we give an ove...
متن کاملAnnulets of Stone lattices generated by pseudo-complements
The notion of pseudo-annulets is introduced in Stone lattices and characterized in terms of prime filters. Two operator α and β are introduced and obtained that their composition β ◦α is a closure operator on the class of all filters of a Stone lattice. A congruence θ is introduced on a Stone lattice L and proved that the quotient lattice L/θ is a Boolean algebra.
متن کاملDIRECTLY INDECOMPOSABLE RESIDUATED LATTICES
The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...
متن کاملWeighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization
We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability problem.
متن کامل